-additive families and the invariance of Borel classes

We prove that any -additive family of sets in an absolutely Souslin metric space has a -discrete refinement provided every partial selector set for is -discrete. As a corollary we obtain that every mapping of a metric space onto an absolutely Souslin metric space, which maps -sets to -sets and has complete fibers, admits a section of the first class. The invariance of Borel and Souslin sets under mappings with complete fibers, which preserves -sets, is shown as an application of the previous result.

     

Nonautonomous Kato classes of measures and Feynman-Kac propagators

The behavior of the Feynman-Kac propagator corresponding to a time-dependent measure on is studied. We prove the boundedness of the propagator in various function spaces on , and obtain a uniqueness theorem for an exponentially bounded distributional solution to a nonautonomous heat equation.

     

On a class of Riemann surfaces

It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.     

Ambiguous chance constrained problems and robust optimization

In this paper we study ambiguous chance constrained problems where the distributions of the random parameters in the problem are themselves uncertain. We focus primarily on the special case where the uncertainty set of the distributions is of the form where ρ_p denotes the Prohorov metric. The ambiguous chance constrained problem is approximated by a robust sampled problem where each constraint is a robust constraint centered at a sample drawn according to the central measure The main contribution of this paper is to show that the robust sampled problem is a good approximation for the ambiguous chance constrained problem with a high probability. This result is established using the Strassen-Dudley Representation Theorem that states that when the distributions of two random variables are close in the Prohorov metric one can construct a coupling of the random variables such that the samples are close with a high probability. We also show that the robust sampled problem can be solved efficiently both in theory and in practice. Research partially supported by NSF grant CCR-00-09972. Research partially supported by NSF grants CCR-00-09972, DMS-01-04282, and ONR grant N000140310514.     

Time allocated to mathematics in post-primary schools in Ireland: are we in double trouble?

Mathematics educators and legislators worldwide have begun placing a greater emphasis on teaching mathematics for understanding and through the use of real-life applications. Revised curricula have led to the time allocated to mathematics in effected countries being scrutinised. This has resulted in policy-makers and educationalists worldwide calling for the inclusion of double class periods on the mathematics timetable. Research from the United States suggests that the introduction of double or block periods allow for the objectives of revised curricula to be realized. The aim of this study, which is set in the school context, is first to ascertain if schools in Ireland are scheduling double periods for mathematics at both lower post-primary level (Junior Cycle) and upper post-primary level (Senior Cycle). It also seeks to determine if there is a link between teachers’ levels of satisfaction with the time allocated to mathematics and the provision of double periods and to get insights from teachers in relation to their opinions on what can be achieved through the introduction of such classes. Questionnaires were sent to 400 post-primary schools (approximately 1600 teachers) which were selected using stratified sampling techniques. It was found that 8.7% of mathematics teachers reported the provision of double periods at Junior Cycle while 55% reported that double periods were included on their timetable at Senior Cycle. The study also identified a link between teachers’ levels of satisfaction with the time allocated to mathematics and the provision of double periods. Finally, teachers felt that double periods allowed for new teaching methodologies, which were promoted by the revised curricula, to be implemented and teaching for understanding was also more feasible. In essence, it was found that double periods have an influence on the mathematical experience of post-primary students as well as the teaching approaches employed.     

Beyond abstract elementary classes: On the model theory of geometric lattices

Based on Crapo's theory of one point extensions of combinatorial geometries, we find various classes of geometric lattices that behave very well from the point of view of stability theory. One of them, $({\mathbf{K}}^3,?)$, is ω-stable, it has a monster model and an independence calculus that satisfies all the usual properties of non-forking. On the other hand, these classes are rather unusual, e.g. in $({\mathbf{K}}^3,?)$ the Smoothness Axiom fails, and so $({\mathbf{K}}^3,?)$ is not an AEC.     

Symmetry classes of tensors and semi-direct product of finite abelian groups

In the study of symmetry classes of tensors, finding examples of symmetry classes of tensors that possess an o*-basis is of considerable interest. There are only few classes of groups that have been provided a necessary and sufficient condition for having such a basis. There is no general criterion for any finite group yet. In this note, we provide a necessary and sufficient condition for the existence of o*-basis of symmetry classes of tensors associated with semi-direct product of some finite abelian groups and, consequently, their wreath product.     

����˿͹����Ŷ�ϵͳ����Ϣ����

The discriminatory processor sharing queues with multiple classes of customers (abbreviated as DPS queues) are an important but difficult research direction in queueing theory, and it has many important practical applications in the fields of, such as, computer networks, manufacturing systems, transportation networks, and so forth. Recently, researchers have carried out some key work for the DPS queues. They gave the generating function of the steady-state joint queue lengths, which leads to the first two moments of the steady-state joint queue lengths. However, using the generating function to provide explicit expressions for the steady-state joint queue lengths has been a difficult and challenging problem for many years. Based on this, this paper applies the maximum entropy principle in the information theory to providing an approximate expression with high precision, and this approximate expression can have the same first three moments as those of its exact expression. On the other hand, this paper gives efficiently numerical computation by means of this approximate expression, and analyzes how the key variables of this approximate expression depend on the original parameters of this queueing system in terms of some numerical experiments. Therefore, this approximate expression has important theoretical significance to promote practical applications of the DPS queues. At the same time, not only do the methodology and results given in this paper provide a new line in the study of DPS queues, but they also provide the theoretical basis and technical support for how to apply the information theory to the study of queueing systems, queueing networks and more generally, stochastic models.     

Gibbs partitions: The convergent case

We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann‐distributed limit structure. We demonstrate how this setting encompasses arbitrary weighted assemblies of tree‐like combinatorial structures. As an application, we establish smooth growth along lattices for small block‐stable classes of graphs. Random graphs with n vertices from such classes are shown to form a giant connected component. The small fragments may converge toward different Poisson Boltzmann limit graphs, depending along which lattice we let n tend to infinity. Since proper addable minor‐closed classes of graphs belong to the more general family of small block‐stable classes, this recovers and generalizes results by McDiarmid (2009).